- Title
- Clique vertex magic cover of a graph
- Creator
- Sugeng, K. A.; Ryan, J.
- Relation
- Mathematics in Computer Science Vol. 5, Issue 1, p. 113-118
- Publisher Link
- http://dx.doi.org/10.1007/s11786-011-0077-2
- Publisher
- Springer
- Resource Type
- journal article
- Date
- 2011
- Description
- Let G admit an H-edge covering and f : V⋃E → {1,2,…,n+e} be a bijective mapping for G then f is called H-edge magic total labeling of G if there is a positive integer constant m(f) such that each subgraph Hί, ί , i = 1, . . . , r of G is isomorphic to H and f(Hί)=f(H)=Σ v∈V(Hί) f(v)+Σ e∈V(Hί) f(e)=m(f). In this paper we define a subgraph-vertex magic cover of a graph and give some construction of some families of graphs that admit this property. We show the construction of some Cn - vertex magic covered and clique magic covered graphs.
- Subject
- edge covering; edge magic total labeling; subgraph-vertex magic cover
- Identifier
- http://hdl.handle.net/1959.13/1065135
- Identifier
- uon:17756
- Identifier
- ISSN:1661-8270
- Language
- eng
- Reviewed
- Hits: 723
- Visitors: 845
- Downloads: 0
| Thumbnail | File | Description | Size | Format |
|---|